"Turán's brick factory problem" meaning in English

{
  "etymology_text": "Named after Pál Turán, who formulated it while working in a brick factory during World War II.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán's brick factory problem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "id": "en-Turán's_brick_factory_problem-en-name-kDtuR~Tc",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimum",
          "minimum"
        ],
        [
          "number",
          "number"
        ],
        [
          "crossing",
          "crossing"
        ],
        [
          "drawing",
          "drawing"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "bipartite",
          "bipartite"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Turán's brick factory problem"
}

{
  "etymology_text": "Named after Pál Turán, who formulated it while working in a brick factory during World War II.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán's brick factory problem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with Á",
        "English terms spelled with ◌́",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimum",
          "minimum"
        ],
        [
          "number",
          "number"
        ],
        [
          "crossing",
          "crossing"
        ],
        [
          "drawing",
          "drawing"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "bipartite",
          "bipartite"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Turán's brick factory problem"
}